An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs
نویسنده
چکیده
We consider the general nonlinear optimization problem in 01 variables and provide an explicit equivalent convex positive semidefinite program in 2 − 1 variables. The optimal values of both problems are identical. From every optimal solution of the former one easily find an optimal solution of the latter and conversely, from every solution of the latter one may construct an optimal solution of the former.
منابع مشابه
A MAX-CUT formulation of 0/1 programs
We consider the linear or quadratic 0/1 program P : f = min{cx + xFx : Ax = b; x ∈ {0, 1}}, for some vectors c ∈ R, b ∈ Z, some matrix A ∈ Zm×n and some real symmetric matrix F ∈ Rn×n. We show that P can be formulated as a MAX-CUT problem whose quadratic form criterion is explicit from the data of P. In particular, to P one may associate a graph whose connectivity is related to the connectivity...
متن کاملSolving Semidefinite Programs via Nonlinear Programming Part I: Transformations and Derivatives∗
In this paper, we introduce a transformation that converts a class of linear and nonlinear semidefinite programming (SDP) problems into nonlinear optimization problems over “orthants” of the form <++ × <N , where n is the size of the matrices involved in the problem and N is a nonnegative integer dependent upon the specific problem. For example, in the case of the SDP relaxation of a MAXCUT pro...
متن کاملQuadratic third-order tensor optimization problem with quadratic constraints
Quadratically constrained quadratic programs (QQPs) problems play an important modeling role in many diverse problems. These problems are in general NP hard and numerically intractable. Semidefinite programming (SDP) relaxations often provide good approximate solutions to these hard problems. For several special cases of QQP, e.g., convex programs and trust region subproblems, SDP relaxation pr...
متن کاملAn exact Jacobian SDP relaxation for polynomial optimization
Given polynomials f(x), gi(x), hj(x), we study how to minimize f(x) on the set S = {x ∈ R : h1(x) = · · · = hm1(x) = 0, g1(x) ≥ 0, . . . , gm2(x) ≥ 0} . Let fmin be the minimum of f on S. Suppose S is nonsingular and fmin is achievable on S, which are true generically. This paper proposes a new type semidefinite programming (SDP) relaxation which is the first one for solving this problem exactl...
متن کاملHidden Integrality of SDP Relaxation for Sub-Gaussian Mixture Models
We consider the problem of estimating the discrete clustering structures under Sub-Gaussian Mixture Models. Our main results establish a hidden integrality property of a semidefinite programming (SDP) relaxation for this problem: while the optimal solutions to the SDP are not integer-valued in general, their estimation errors can be upper bounded in terms of the error of an idealized integer pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001